Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
نویسندگان
چکیده
منابع مشابه
Distributed strategies for generating weight-balanced and doubly stochastic digraphs
This paper deals with the design and analysis of dynamical systems on directed graphs (digraphs) that achieve weight-balanced and doubly stochastic assignments. Weight-balanced and doubly stochastic digraphs are two classes of digraphs that play an essential role in a variety of coordination problems, including formation control, agreement, and distributed optimization. We refer to a digraph as...
متن کاملContinuous-time Distributed Convex Optimization with Set Constraints ⋆
We study a distributed convex optimization problem with set constraints. The objective function is a summation of strictly convex functions. Based on a multi-agent system formulation, we consider that each node is with continuous-time dynamics and can only access its local objective function. Meanwhile, each node is subject to a common convex set constraint. The nodes can exchange local informa...
متن کاملDistributed Convex Optimization with Inequality Constraints over Time-varying Unbalanced Digraphs
This paper considers a distributed convex optimization problem with inequality constraints over time-varying unbalanced digraphs, where the cost function is a sum of local objectives, and each node of the graph only knows its local objective and inequality constraints. Although there is a vast literature on distributed optimization, most of them require the graph to be balanced, which is quite ...
متن کاملDistributed Optimization in Multi-Agent Systems: Game Theory Based Sensor Coverage and Continuous-Time Convex Optimization
OF THE DISSERTATION Distributed Optimization in Multi-Agent Systems: Game Theory Based Sensor Coverage and continuous-time Convex Optimization by Salar Rahili Doctor of Philosophy, Graduate Program in Electrical Engineering University of California, Riverside, December 2016 Dr. Wei Ren, Chairperson A multi-agent system is defined as a collection of autonomous agents which are able to interact w...
متن کاملDistributed convex optimization via continuous-time coordination algorithms with discrete-time communication
This paper proposes a novel class of distributed continuous-time coordination algorithms to solve network optimization problems whose cost function is strictly convex and equal to a sum of local cost functions associated to the individual agents. We establish the exponential convergence of the proposed algorithm under (i) strongly connected and weight-balanced digraph topologies when the local ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2014
ISSN: 0018-9286,1558-2523
DOI: 10.1109/tac.2013.2278132